On a Spanning Tree with Specified Leaves
نویسندگان
چکیده
منابع مشابه
On a Spanning Tree with Specified Leaves
Let k ≥ 2 be an integer. We show that if G is a (k + 1)-connected graph and each pair of nonadjacent vertices in G has degree sum at least |G| + 1, then for each subset S of V (G) with |S| = k, G has a spanning tree such that S is the set of endvertices. This result generalizes Ore’s theorem which guarantees the existence of a Hamilton path connecting any two vertices.
متن کاملSpanning subgraphs with specified valencies
The author has published a necessary and sufficient condition for a fmite loopless graph to have a spanning subgraph with a specified positive valency at each vertex (see [8,9). In the present paper it is contended that the condition can be made more useful as a tool of graph theory by imposing a maximality condition. 1. The condition for an I-factor Let G be a finite graph. Loops and multiple ...
متن کاملOn finding spanning trees with few leaves
The problem of finding a spanning tree with few leaves is motivated by the design of communication networks, where the cost of the devices depends on their routing functionality (ending, forwarding, or routing a connection). Besides this application, the problem has its own theoretical importance as a generalization of the Hamiltonian path problem. Lu and Ravi showed that there is no constant f...
متن کاملMax-leaves spanning tree is APX-hard for cubic graphs
We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs). MaxLeaf is known to be APX-hard in general, and NP-hard for cubic graphs. We show that the problem is also APX-hard for cubic graphs. The APX-...
متن کاملOn spanning k-tree in which specified vertices have degree less than k
A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k. We denote by σk(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k ≥ 3 and s ≥ 0 be integers, and suppose G is a connected graph and σk(G) ≥ |V (G)|+s−1. Then for any s specifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2008
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-007-0768-2